// 1. Insert sort
pub fn insert_sort(arr: &mut Vec<i32>) {
    for i in 1..arr.len() {
        for j in (1..=i).rev() {
            if arr[j] < arr[j-1] {
                arr.swap(j, j-1);
            }
        }
    }
}
// 1.1 Odd even sort
pub fn sort_array_by_parity(arr: &mut Vec<i32>) -> Vec<i32> {
    let mut j = 0_usize;
    for i in 0..arr.len() {
        if arr[i]%2 == 0 {
            arr.swap(i, j);
            j += 1;
        }
    }
    arr.to_vec()
}
